On linear vector optimization duality in infinite-dimensional spaces∗
نویسنده
چکیده
In this paper we extend to infinite-dimensional spaces a vector duality concept recently considered in the literature in connection to the classical vector minimization linear optimization problem in a finite-dimensional framework. Weak, strong and converse duality for the vector dual problem introduced with this respect are proven and we also investigate its connections to some classical vector duals considered in the same framework in the literature.
منابع مشابه
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization
Duality theory is pervasive in finite dimensional optimization. There is growing interest in solving infinite-dimensional optimization problems and hence a corresponding interest in duality theory in infinite dimensions. Unfortunately, many of the intuitions and interpretations common to finite dimensions do not extend to infinite dimensions. In finite dimensions, a dual solution is represented...
متن کاملNew regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
We give new regularity conditions based on epigraphs that assure strong duality between a given primal convex optimization problem and its Lagrange and Fenchel-Lagrange dual problems, respectively, in infinite dimensional spaces. Moreover we completely characterize through equivalent statements the so-called stable strong duality between the initial problem and the mentioned duals.
متن کاملExistence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming
Semi-Markov decision processes on Borel spaces with deterministic kernels have many practical applications, particularly in inventory theory. Most of the results from general semi-Markov decision processes do not carry over to a deterministic kernel since such a kernel does not provide “smoothness.” We develop infinite dimensional linear programming theory for a general stochastic semi-Markov d...
متن کاملDuality in convex minimum cost flow problems in infinite networks
Minimum cost flow problems in infinite networks arise, for example, in infinite-horizon sequential decision problems such as production planning. Strong duality for these problems was recently established for the special case of linear costs using an infinite-dimensional simplex algorithm. Here, we use a different approach to derive duality results when the costs are convex. We formulate the pr...
متن کاملCyclic wavelet systems in prime dimensional linear vector spaces
Finite affine groups are given by groups of translations and di- lations on finite cyclic groups. For cyclic groups of prime order we develop a time-scale (wavelet) analysis and show that for a large class of non-zero window signals/vectors, the generated full cyclic wavelet system constitutes a frame whose canonical dual is a cyclic wavelet frame.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011